Nonbinary Quantum Codes from Two-Point Divisors on Hermitian Curves

نویسندگان

  • Martianus Frederic Ezerman
  • Radoslav Kirov
چکیده

Sarvepalli and Klappenecker showed how classical one-point codes on the Hermitian curve can be used to construct quantum codes. Homma and Kim determined the parameters of a larger family of codes, the two-point codes. In quantum error-correction, the observed presence of asymmetry in some quantum channels led to the study of asymmetric quantum codes (AQECCs) where we no longer assume that the different types of errors are equiprobable. This paper considers quantum codes constructed from the two-point codes. In the asymmetric case, we show strict improvements over all possible finite fields for a range of designed distances. We produce large dimension pure AQECC and small dimension impure AQECC that have better parameters than AQECC from one-point codes. Numerical results for the Hermitian curves over F16 and F64 are used to illustrate the gain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Codes from Two-Point Divisors on Hermitian and Suzuki Curves

Sarvepalli and Klappenecker showed how to use classical one-point codes on the Hermitian curve to construct symmetric quantum codes. For the said curve, Homma and Kim determined the parameters of a larger family of codes, the two-point codes. For the Suzuki curve, the bound due to Duursma and Kirov gave the exact minimum distance of Suzuki two-point codes over F8 and F32. Of more recent develop...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Nonbinary quantum error-correcting codes from algebraic curves

We give a generalized CSS construction for nonbinary quantum error-correcting codes. Using this we construct nonbinary quantum stabilizer codes from algebraic curves. We also give asymptotically good nonbinary quantum codes from a GarciaStichtenoth tower of function fields which are constructible in polynomial time. keywords Algebraic geometric codes, nonbinary quantum codes.

متن کامل

Delta sets for divisors supported in two points

In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well as improved thresholds for algebraic geometric linear secret sharing schemes. The coset bounds depend on the choice of a sequence of divisors and on its intersection with a given set of divisors called a delta set. In t...

متن کامل

Coset bounds for algebraic geometric codes

For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A− C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a party A that can recover the secret in an algebraic geometric linear secret sharing scheme with adversary threshold C, and (2) lower bounds for the support A...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1102.3605  شماره 

صفحات  -

تاریخ انتشار 2011